A Survey of Weighted Polynomial Approximation with Exponential Weights
نویسنده
چکیده
Let W : R → (0, 1] be continuous. Bernstein’s approximation problem, posed in 1924, deals with approximation by polynomials in the weighted uniform norm f → ‖fW‖L∞(R). The qualitative form of this problem was solved by Achieser, Mergelyan, and Pollard, in the 1950’s. Quantitative forms of the problem were actively investigated starting from the 1960’s. We survey old and recent aspects of this topic, including the Bernstein problem, weighted Jackson and Bernstein Theorems, Markov–Bernstein and Nikolskii inequalities, orthogonal expansions and Lagrange interpolation. We present the main ideas used in many of the proofs, and different techniques of proof, though not the full proofs. The class of weights we consider is typically even, and supported on the whole real line, so we exclude Laguerre type weights on [0,∞). Nor do we discuss Saff’s weighted approximation problem, nor the asymptotics of orthogonal polynomials. MSC: 41A10, 41A17, 41A25, 42C10
منابع مشابه
What use are Exponential Weights for flexi-Weighted Least Squares Phylogenetic Trees?
. The method of flexi-Weighted Least Squares on evolutionary trees uses simple polynomial or exponential functions of the evolutionary distance in place of model-based variances. This has the advantage that unexpected deviations from additivity can be modeled in a more flexible way. At present, only polynomial weights have been used. However, a general family of exponential weights is desirable...
متن کاملL∞-Approximation in Korobov spaces with exponential weights
We study multivariate L∞-approximation for a weighted Korobov space of periodic functions for which the Fourier coefficients decay exponentially fast. The weights are defined, in particular, in terms of two sequences a = {aj} and b = {bj} of positive real numbers bounded away from zero. We study the minimal worstcase error eL∞−app,Λ(n, s) of all algorithms that use n information evaluations fro...
متن کاملThe degree of shape preserving weighted polynomial approximation
We analyze the degree of shape preserving weighted polynomial approximation for exponential weights on the whole real line. In particular, we establish a Jackson type estimate. Keywords: Shape Preserving Polynomials, k-Monotone, Exponential Weights, Jackson Theorem, Freud Weights. AMS Classi cation: 41A29, 41A17 Research supported by NSF grant DMS1001182 and US-Israel BSF grant 2008399 1. Intro...
متن کاملTractability of approximation of ∞-variate functions with bounded mixed partial derivatives
u ⊂ N+ and each fu depends only on variables listed in u. We present corresponding multivariate decomposition methods and show that they lead to polynomial tractability under suitable assumptions concerning γ weights and the probability density functions ψ and ω. For instance, suppose that the cost of evaluating functions with d variables is at most exponential in d and the weights γ decay to z...
متن کاملCompetitive Algorithms for the Weighted Server Problem
Fiat, A. and M. Ricklin, Competitive algorithms for the weighted server problem, Theoretical Computer Science 130 (1994) 85-99. In this paper we deal with a generalization of the k-server problem (Manasse et al. 1988) in which the servers are unequal. In the weighted server mode1 each of the servers is assigned a positive weight. The cost associated with moving a server equals the product of th...
متن کامل